Optimal Type Lifting Optimal Type Lifting
نویسندگان
چکیده
Modern compilers for ML-like polymorphic languages have used explicit run-time type passing to support advanced optimizations such as intensional type analysis, representation analysis and tagless garbage collection. Unfortunately, maintaining type information at run time can incur a large overhead to the time and space usage of a program. In this paper, we present an optimal type-lifting algorithm that lifts all type applications in a program to the top level. Our algorithm eliminates all run-time type constructions within any core-language functions. In fact, it guarantees that the number of types built at run time is strictly a static constant. We present our algorithm as a type-preserving source-to-source transformation and show how to extend it to handle the entire SML'97 with higher-order modules.
منابع مشابه
Optimal Trajectory Study of a Small Size Waverider and Wing-Body Reentry Vehicle at Suborbital Entry Speed of Approximately 4 km/s with Dynamic Pressure and Heat Rate Constraint
A numerical trajectory optimization study of two types of lifting-entry reentry vehicle has been presented at low suborbital speed of 4.113 km/s and -15 degree entry angle. These orbital speeds are typical of medium range ballistic missile with ballistic range of approximately 2000 km at optimum burnout angle of approximately 41 degree for maximum ballistic range. A lifting reentry greatly enha...
متن کاملOptimal Type Lifting
Modern compilers for ML-like polymorphic languages have used explicit run-time type passing to support advanced optimizations such as intensional type analysis, representation analysis and tagless garbage collection. Unfortunately, maintaining type information at run time can incur a large overhead to the time and space usage of a program. In this paper, we present an optimal type-lifting algor...
متن کاملA Lifting Argument for the Generalized Grigorieff Forcing
In this short paper, we describe another class of forcing notions which preserve measurability of a large cardinal κ from the optimal hypothesis, while adding new unbounded subsets to κ . In some ways these forcings are closer to the Cohen-type forcings — e.g. we show that they are not minimal — however, they share some properties with tree-like forcings. We show that they admit fusion-type arg...
متن کاملBV -maps with values into S1: graphs, minimal connections and optimal lifting
The aim of this paper is to extend to the higher dimension n ≥ 2 the results from [11] about minimal connections and optimal lifting of maps of bounded variation with values into S. More precisely, we first outline the link between lifting and connections of maps in BV (B, S), Theorem 4.4. Secondly, we write in an explicit way the energy of the optimal lifting of BV -maps, Theorem 4.8. Finally,...
متن کاملLifting speed preferences and their effects on the maximal lifting capacity
The objectives of this study were to evaluate how lifting capacity and subjective preferences are affected by different lifting speeds. The maximum lifting capacity of lift was determined with three independent variables, lifting speed, lifting technique, and lifting height. Questionnaires were evaluated after the experiment by the participants for the lifting speed preferences. This study foun...
متن کامل